Maximally permissive controlled system synthesis for non-determinism and modal logic
نویسندگان
چکیده
منابع مشابه
Maximally permissive controlled system synthesis for non-determinism and modal logic
We propose a new technique for controlled system synthesis on nondeterministic automata for requirements in modal logic. Synthesis, as defined in this paper, restricts a behavioral specification of the uncontrolled system such that it satisfies a given logical expression, while adhering to the rules dictated by supervisory control such as maximal permissiveness and controllability. The applied ...
متن کاملMaximally Permissive Controlled System Synthesis for Modal Logic
We propose a new method for controlled system synthesis on non-deterministic automata, which includes the synthesis for deadlockfreeness, as well as invariant and reachability expressions. Our technique restricts the behavior of a Kripke-structure with labeled transitions, representing the uncontrolled system, such that it adheres to a given requirement specification in an expressive modal logi...
متن کاملCompositional Synthesis of Maximally Permissive Supervisors Using Supervision Equivalence
This paper presents a general framework for efficient synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence. In this context, a large number of ways are suggested how a finite-state automaton can be simplified such that the results of supervisor synthesis are preserved. The proposed approach yields a compa...
متن کاملEncapsulating Non-Determinism in Functional Logic Computations
One of the key features of the integration of functional and logic languages is the access to non-deterministic computations from the functional part of the program. In order to ensure the determinism of top-level computations in a functional logic program, which is usually a monadic sequence of I/O operations, one has to encapsulate the non-determinism (i.e., search for solutions) occurring in...
متن کاملNon-Denumerable Infinitary Modal Logic
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Event Dynamic Systems
سال: 2016
ISSN: 0924-6703,1573-7594
DOI: 10.1007/s10626-016-0231-8